Using the B-Toolkit to Ensure Safety in SCR Speci cations

نویسندگان

  • Indrakshi Ray
  • Paul Ammann
چکیده

SCR (Software Cost Reduction) speciications are useful for specifying event-driven systems. To use SCR eeectively for critical applications, automated veriication of safety properties is important. Towards this end, Atlee and others proposed model checking and symbolic model checking approaches. The fact that these approaches are sometimes problematic motivates our alternative approach based on theorem proving. Theorem proving, in general, is a diicult task; however, the regular structure of the proof obligations generated from SCR speciications suggests that relatively unsophisticated theorem provers can discharge many of these obligations. As a feasibility study, we use the B-Toolkit to detect safety violations in an example SCR speciication. The B-Toolkit is a good choice because it is commercially available and supports veriied reenement to executables in a commercial programming language (C). We convert the mode transition table in the example SCR speciication to an AMN (Abstract Machine Notation) speciication and analyze the result with the B-Toolkit. The B-Toolkit generates 120 proof obligations of which 113 are automatically discharged by the theorem prover. The remaining 7 proof obligations are, in fact, not theorems and correspond to the 3 problems in the SCR speciication detected by the model checking approaches. For the corrected SCR speciication, the B-Toolkit automatically discharges all proof obligations. The example shows that even simple theorem provers are a viable approach to automated analysis for SCR speciications.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verifying Scr Requirements Speciications Using State Exploration

Researchers at the Naval Research Laboratory (NRL) have been developing a formal method, known as the SCR (Software Cost Reduction) method, to specify the requirements of software systems using tables. NRL has developed a formal state machine model de ning the SCR semantics and support tools for analysis and validation. Recently, a veri cation capability was added to the SCR toolset. Users can ...

متن کامل

Model Checking Complete Requirements Speci cations Using Abstraction

Although model checking has proven remarkably e ective in detecting errors in hardware designs, its success in the analysis of software speci cations has been quite limited. Model checking algorithms for hardware veri cation commonly use Binary Decision Diagrams (BDDs), a highly e ective technique for analyzing speci cations with the scores of Boolean variables commonly found in hardware descri...

متن کامل

Finding Mode Invariants in SCR Speci cations

This paper introduces an algorithm and a new graph, the Conditioned Transition Graph (CTG), to derive the mode invariants from an Software Cost Reduction (SCR) mode transition table. An SCR requirements document contains a complete description of the external behavior of the software system. Some system properties, such as mode invariants, can be used to describe safety features that must be en...

متن کامل

Draft Safety Checklist for Four-Variable Requirements Methods

This paper organizes safety criteria, as given by Leveson, Ja e, Heimdahl, Melhart, and Lutz, as a safety checklist for use on four-variable requirements models for real-time process-control systems. Special attention is given to the Software Productivity Consortium CoRE and Naval Research Laboratory SCR requirements speci cations built on the four-variable model. The criteria are presented in ...

متن کامل

Analyzing Tabular and State-transition Requirements Speciications in Pvs 1

We describe PVS's capabilities for representing tabular speci cations of the kind advocated by Parnas and others, and show how PVS's Type Correctness Conditions (TCCs) are used to ensure certain well-formedness properties. We then show how these and other capabilities of PVS can be used to represent the AND/OR tables of Leveson and the Decision Tables of Sherry, and we demonstrate how PVS's TCC...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007